An Optimal Algorithm for Conflict-Free Coloring for Tree of Rings
نویسندگان
چکیده
منابع مشابه
An Optimal Algorithm for Conflict-Free Coloring for Tree of Rings
An optimal algorithm is presented about Conflict-Free Coloring for connected subgraphs of tree of rings. Suppose the number of the rings in the tree is |T| and the maximum length of rings is |R|. A presented algorithm in [1] for a Tree of rings used O(log|T|.log|R|) colors but this algorithm uses O(log|T|+log|R|) colors. The coloring earned by this algorithm has the unique-min property, that is...
متن کاملan application of fuzzy logic for car insurance underwriting
در ایران بیمه خودرو سهم بزرگی در صنعت بیمه دارد. تعیین حق بیمه مناسب و عادلانه نیازمند طبقه بندی خریداران بیمه نامه براساس خطرات احتمالی آنها است. عوامل ریسکی فراوانی می تواند بر این قیمت گذاری تاثیر بگذارد. طبقه بندی و تعیین میزان تاثیر گذاری هر عامل ریسکی بر قیمت گذاری بیمه خودرو پیچیدگی خاصی دارد. در این پایان نامه سعی در ارائه راهی جدید برای طبقه بندی عوامل ریسکی با استفاده از اصول و روش ها...
Online conflict-free coloring for geometric hypergraphs
(i) We provide a framework for online conflict-free coloring (CF-coloring) any hypergraph. We use this framework to obtain an efficient randomized online algorithm for CF-coloring any k-degenerate hypergraph. Our algorithm uses O(k log n) colors with high probability and this bound is asymptotically optimal for any constant k. Moreover, our algorithm uses O(k log k log n) random bits with high ...
متن کاملConflict-free Coloring for Connected Subgraphs of Trees and Trees of Rings
We introduce the Connected-Subgraphs Conflict-Free Coloring problem which has applications to frequency assignment in cellular networks: given a graph, assign a minimum number of colors to its vertices in such a way that each connected subgraph contains a vertex with a color that is unique among the colors of all other vertices in that subgraph. We propose an algorithm that achieves an optimal ...
متن کاملAn Optimal Termination Detection Algorithm for Rings
Rings Murat Demirbas Anish Arora 1 Department of Computer and Information S ien e The Ohio State University Columbus, Ohio 43210 USA Abstra t This paper presents an optimal termination dete tion algorithm for rings. The algorithm is based on Safra's and Dijkstra et al.'s [1℄ algorithm. It optimizes the time onstant of the Dijkstra & Safra algorithm from 2N 3N to 0 N , where N denotes the number...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Science & Engineering: An International Journal
سال: 2012
ISSN: 2231-3583
DOI: 10.5121/cseij.2012.2101